Determinism in the one-way model

Determinism in the one-way model

We introduce a flow condition on one-way measurement patterns which guarantees globally deterministic behaviour. Dependent Pauli corrections are derived for all such patterns, which 1) equalise all computation branches, and 2) only depend on the underlying entanglement graph and its choice of inputs and outputs. The class of patterns having flow is stable under composition and tensorisation, an...

Finding flows in the one-way measurement model

The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform a unitary embedding between two Hilbert spaces is for the graph G (together with input/output vertices I,O ⊆ V (G)) to have a flow in the sense introduced b...

Options for one-way RE model

Syntax Menu Description Options for one-way RE model Options for two-way RE and ME models Remarks and examples Stored results Methods and formulas References Also see Syntax Calculate intraclass correlations for one-way random-effects model icc depvar target if in , oneway options Calculate intraclass correlations for two-way random-effects model icc depvar target rater if in , twoway re option...

The One-Way-Table

Computational model underlying the one-way quantum computer

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in n...